A PostgreSQL/PostGIS Implementation for the Sightseeing Tour Planning Problem
نویسندگان
چکیده
منابع مشابه
A Mixed Integer Model for the Stamina-Aware Sightseeing Tour Problem
Personal navigation systems have experienced a rising interest in the past few years thanks to the ever-increasing ubiquity of smartphones and in-car navigation systems. In their simplest forms, the goal is to calculate routes that are optimized with respect to criteria such as travel time and distance. Various systems have been proposed that allow for additional dynamic aspects to be included ...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولTour Planning for Sightseeing with Time-Dependent Satisfactions of Activities and Traveling Times
This paper proposes a new personal tour planning problem with time-dependent satisfactions, traveling and activity duration times for sightseeing. It is difficult to represent the time-dependent model using general static network models, and hence, Time-Expanded Network (TEN) is introduced. The TEN contains a copy to the set of nodes in the underlying static network for each discrete time step,...
متن کاملSightseeing Route Planning
Route planning is a challenging task because it is a combination of theoretically well-defined computational problems on one side, and everyday-life decisions and constraints on the other side. This paper presents an approach to sightseeing route planning using theory of computation. In particular, in this paper we discuss the combination of two well-known computational problems: knapsack and t...
متن کاملTwo new heuristic algorithms for Covering Tour Problem
Covering Tour Problem (CTP) is the generalized form of Traveling Salesman Problem (TSP), which has found different applications in the designing of distribution networks, disaster relief, and transportation routing. The purpose of this problem is to determine the Hamiltoniancyclewiththe lowest costusinga subset of all the nodes, such that the other nodes would be in a distance shorter than the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Jurnal Rekayasa Elektrika
سال: 2013
ISSN: 2252-620X,1412-4785
DOI: 10.17529/jre.v10i3.1011